Recursion and Computability over Topological Structures
نویسندگان
چکیده
منابع مشابه
Recursion over Realizability Structures
Realizability structures play a major role in the metamathematics of intuitionistic systems and they are a basic tool in the extraction of the computational content of constructive proofs. Besides their rich categorical structure and effectiveness properties provide a privileged mathematical setting for the semantics of data types of programming languages. In this paper we emphasize the modelli...
متن کاملComputability and recursion
We consider the informal concept of “computability” or “effective calculability” and twoof the formalisms commonly used to define it, “(Turing) computability” and“(general) recursiveness”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecia...
متن کاملIntrinsic computability over algebraic structures
The notion of computable function can be extended from the natural numbers to other domains, using an indexing. Usually, the choice of the indexing affects the set of computable functions and there is no intrinsic notion of computability over these domains. In this paper, we show that, in contrast, when we extend the notion of computable function to algebraic structures, we obtain an intrinsic ...
متن کاملOrdered Structures and Computability Ordered Structures and Computability Dedication
We consider three questions surrounding computable structures and orderings. First, we make progress toward answering a question of Downey, Hirschfeldt, and Goncharov by showing that for a large class of countable linear orderings, the Turing degree spectrum of the successor relation is closed upward in the c.e. degrees. Next we consider computable partial orders (specifically, finitely branchi...
متن کاملRecursive and computable operations over topological structures
concrete high-level language assembler language closure schemes Turing machines recursive operations computable operations Figure 1.1: Abstract versus concrete models given by the μ–recursive functions which have been developed by Herbrand, Gödel, Kleene and others [Kle36]. In the past, several different generalizations of recursive closure schemes in abstract settings have been suggested and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80032-5